Synchronized Alternating Turing Machines on Four-Dimensional Input Tapes
نویسندگان
چکیده
Synchronized alternating machine is an alternating machine with a special subset of internal states called synchronizing states. This paper introduces a four-dimensional synchronized alternating Turing machine (4-SATM ), and investigates fundamental properties of 4-SATM ’s. The main topics of this paper are: (1) a relationship between the accepting powers of 4-SATM ’s and four-dimensional alternating Turing machines with small space bounds, (2) a relationship between the accepting powers of seven-way and eight-way 4-SATM ’s, (3) a relationship between the accepting powers of 4-SATM ’s and four-dimensional nondeterministic Turing machines. In this paper, we let each sidelength of each input tape of these automata be equivalent in order to increase the theoretical interest. Key–Words: alternation, computational complexity, configuration, four-dimensional Turing machine, synchronization
منابع مشابه
Some Accepting Powers of Three-Dimensional Synchronized Alternating Turing Machines
This paper introduces a three-dimensional synchronized alternating Turing machine (3-SATM), and investigates fundamental properties of 3-SATM ′s whose input tapes are restricted to cubic ones. The main topics of this paper are: (1) a relationship between the accepting powers of 3-SATM ′s and three-dimensional alternating Turing machines with small space bounds, (2) a relationship between the ac...
متن کاملFour-Dimensional Synchronized Alternating Turing Machines
Synchronized alternating machine is an alternating machine with a special subset of internal states called synchronizing states. This paper introduces a four-dimensional synchronized alternating Turing machine (4-SATM ), and investigates fundamental properties of 4-SATM ’s. The main topics of this paper are: (1) a relationship between the accepting powers of 4-SATM ’s and four-dimensional alter...
متن کاملConstant Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines
‘Leaf-size’ (or ‘branching’) is the minimum number of leaves of some accepting computation trees of alternating devices. For example, one leaf corresponds to nondeterministic computation. In this paper, we investigate the effect of constant leaves of three-dimensional alternating Turing machines, and show the following facts : (1) For cubic input tapes, k leafand L(m) space-bounded three-dimens...
متن کاملSome Results about Hierarchy and Recognizability of Four-Dimensional Synchronized Alternating Turing Machines
The recent advances in computer animation, motion image processing, robotics and so on prompted us to analyze computational complexity of four-dimensional pattern processing. Thus, the research of four-dimensional automata as a computational model of four-dimensional pattern processing has also been meaningful. From this viewpoint, we introduced a four-dimensional alternating Turing machine (4-...
متن کاملHardware Hierarchies and Recognizabilities of Four-Dimensional Synchronized Alternating Turing Machines
The recent advances in computer animation, motion image processing, robotics and so on prompted us to analyze computational complexity of four-dimensional pattern processing. Thus, the research of four-dimensional automata as a computational model of four-dimensional pattern processing has also been meaningful. From this viewpoint, we introduced a four-dimensional alternating Turing machine (4-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010